Distances forbidden bY two - colorings of Q 3 and A ,
نویسنده
چکیده
Chow, T., Distances forbidden by two-colorings of Q3 and A,, Discrete Mathematics 115 (1993) 95-102. For X = Q3 or A, (where A, is the set of points in Q” whose coordinates have odd denominators), we characterize all sets of distances D c R + with the following property: there exists some two-coloring of X such that, for all d ED, no two points in X that arc a distance d apart are the same color. We also find all numbers do E R + such that all sets of distances D c iw+ with this property retain the property under multiplication or division by do.
منابع مشابه
Patch Colorings and Rigid Colorings of the Rational n-Space
We investigate k-colorings of the rational n-space, Q, such that any two points at distance one get distinct colors. Two types of colorings are considered: patch colorings where the colors occupy open sets with parts of their boundary, and rigid colorings which uniquely extend from any open subset of Q. We prove that the existence of a patch k-coloring of Q implies the existence of a k-coloring...
متن کاملRestricted Coloring Problems and Forbidden Induced Subgraphs
An acyclic coloring of a graph is a proper coloring such that any two color classes induce a forest. A star coloring of a graph is an acyclic coloring with the further restriction that the forest induced by any two color classes is a disjoint collection of stars. We consider the behavior of these problems when restricted to certain classes of graphs. In particular, we give characterizations of ...
متن کاملSemi-algebraic colorings of complete graphs
In this paper, we consider edge colorings of the complete graph, where the vertices are points in R, and each color class Ei is defined by a semi-algebraic relation of constant complexity on the point set. One of our main results is a multicolor regularity lemma: For any 0 < ε < 1, the vertex set of any such edge colored complete graph with m colors can be equitably partitioned into at most (m/...
متن کاملNon-repetitive colorings of infinite sets
In this paper we investigate colorings of sets avoiding similarly colored subsets. If S is an arbitrary colored set and T is a "xed family of bijections of S to itself, then two subsets A; B ⊆ S are said to be colored similarly with respect to T, if there exists a transformation t ∈T mapping A onto B, and preserving a coloring of A. This general setting covers some well-known topics such as non...
متن کاملReset Thresholds of Automata with Two Cycle Lengths
We present several series of synchronizing automata with multiple parameters, generalizing previously known results. Let p and q be two arbitrary co-prime positive integers, q > p. We describe reset thresholds of the colorings of primitive digraphs with exactly one cycle of length p and one cycle of length q. Also, we study reset thresholds of the colorings of primitive digraphs with exactly on...
متن کامل